Search for: All records

Quantum error correction is necessary to perform large-scale quantum computation but requires extremely large overheads in both space and time. High-rate quantum low-density-parity-check (qLDPC) codes promise a route to reduce qubit numbers, but performing computation while maintaining low space cost has required serialization of operations and extra time costs. In this work, we design fast and parallelizable logical gates for qLDPC codes and demonstrate their utility for key algorithmic subroutines such as the quantum adder. Our gate gadgets utilize transversal logical s between a data qLDPC code and a suitably constructed ancilla code to perform parallel Pauli product measurements (PPMs) on the data logical qubits. For hypergraph product codes, we show that the ancilla can be constructed by simply modifying the base classical codes of the data code, achieving parallel PPMs on a subgrid of the logical qubits with a lower space-time cost than existing schemes for an important class of circuits. Generalizations to 3D and 4D homological product codes further feature fast PPMs in constant depth. While prior work on qLDPC codes has focused on individual logical gates, we initiate the study of fault-tolerant compilation with our expanded set of native qLDPC code operations, constructing algorithmic primitives for preparing $k$-qubit Greenberger-Horne-Zeilinger states and distilling or teleporting $k$magic states with $O\left(1\right)$space overhead in $O\left(1\right)$and $O\left(\sqrt{k}\log k\right)$logical cycles, respectively. We further generalize this to key algorithmic subroutines, demonstrating the efficient implementation of quantum adders using parallel operations. Our constructions are naturally compatible with reconfigurable architectures such as neutral atom arrays, paving the way to large-scale quantum computation with low space and time overheads. Published by the American Physical Society2025 

We analyze the use of photonic links to enable large-scale fault-tolerant connectivity of locally error-corrected modules based on neutral atom arrays. Our approach makes use of recent theoretical results showing the robustness of surface codes to boundary noise and combines recent experimental advances in atom-array quantum computing with logical qubits with optical quantum networking techniques. We find the conditions for fault tolerance can be achieved with local two-qubit Rydberg gate and nonlocal Bell-pair errors below 1% and 10%, respectively, without requiring distillation or space-time overheads. Realizing the interconnects with a lens, a single optical cavity, or an array of cavities enables—with sufficient multiplexing—a Bell-pair generation rate in the 1–50 MHz range. When directly interfacing logical qubits, this rate translates to error-correction cycles in the 25–2000 kHz range, satisfying all requirements for fault tolerance and in the upper range fast enough for 100 kHz logical clock cycles. Published by the American Physical Society2025 

Abstract Emergent strongly correlated electronic phenomena in atomically thin transition-metal dichalcogenides are an exciting frontier in condensed matter physics, with examples ranging from bilayer superconductivity and electronic Wigner crystals to the ongoing search for exciton condensation. Here we take a step towards the latter by reporting experimental signatures of unconventional hybridization of the excitons with opposing dipoles consistent with coherence between interlayer electrons in a transition-metal dichalcogenide bilayer. We investigate naturally grown MoS₂homobilayers integrated in a dual-gate device structure allowing independent control of the electron density and out-of-plane electric field. By electron doping the bilayer when electron tunnelling between the layers is negligible, we observe that the two interlayer excitons hybridize, displaying unusual behaviour distinct from both conventional level crossing and anti-crossing. We show that these observations can be explained by quasi-static random coupling between the excitons, which increases with electron density and decreases with temperature. We argue that this phenomenon is indicative of a spatially fluctuating order parameter in the form of interlayer electron coherence, a theoretically predicted many-body state that has yet to be unambiguously established experimentally outside of the quantum Hall regime. 

Neutral-atom quantum processors are a promising platform for large-scale quantum computing. Integrating them with optical cavities enables fast nondestructive qubit readout and access to fast remote entanglement generation for quantum networking. In this work, we introduce a platform for coupling single atoms in optical tweezers to a Fabry-Perot fiber cavity. Leveraging the strong atom-cavity coupling, we demonstrated fast qubit-state readout with ${99.960}_{-24}^{+14}\%$fidelity and two methods for cavity-mediated entanglement generation with integrated error detection. First, we used cavity-carving to generate a Bell state with 91(4)% fidelity and a 32(1)% success rate (the number in parentheses is the standard deviation). Second, we performed a cavity-mediated gate with a deterministic entanglement fidelity of 52.5(18)%, increased to 76(2)% with error detection. Our approach provides a route toward modular quantum computing and networking. 

Realizing computationally complex quantum circuits in the presence of noise and imperfections is a challenging task. While fault-tolerant quantum computing provides a route to reducing noise, it requires a large overhead for generic algorithms. Here, we develop and analyze a hardware-efficient, fault-tolerant approach to realizing complex sampling circuits. We co-design the circuits with the appropriate quantum error-correcting codes for efficient implementation in a reconfigurable neutral atom-array architecture, constituting what we call a of the sampling algorithm. Specifically, we consider a family of $\text{⟦}{2}^D,D,2\text{⟧}$quantum error-detecting codes whose transversal and permutation gate set can realize arbitrary degree- $D$instantaneous quantum polynomial (IQP) circuits. Using native operations of the code and the atom-array hardware, we compile a fault-tolerant and fast-scrambling family of such IQP circuits in a hypercube geometry, realized recently in the experiments by Bluvstein [Nature 626, 7997 (2024)]. We develop a theory of second-moment properties of degree- $D$IQP circuits for analyzing hardness and verification of random sampling by mapping to a statistical mechanics model. We provide strong evidence that sampling from these hypercube IQP circuits is classically hard to simulate even at relatively low depths. We analyze the linear cross-entropy benchmark (XEB) in comparison to the average fidelity and, depending on the local noise rate, find two different asymptotic regimes. To realize a fully scalable approach, we first show that Bell sampling from degree-4 IQP circuits is classically intractable and can be efficiently validated. We further devise new families of $\text{⟦}O\left(d^D\right),D,d\text{⟧}$color codes of increasing distance $d$, permitting exponential error suppression for transversal IQP sampling. Our results highlight fault-tolerant compiling as a powerful tool in co-designing algorithms with specific error-correcting codes and realistic hardware.